NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
911	CS 330 – Spring 2013, Assignment 6 Problems due in the drop-box by 5PM, Thursday, April 18th (Monday schedule that day) Late assignments will only be accepted up until 5PM on Friday, April 19th Question[removed]pts). Cha Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-04-05 16:53:19 Applied mathematics NP-complete NP P P versus NP problem NP-hard Theoretical computer science Computational complexity theory Complexity classes
912	Graph Coloring with Quantum Heuristics Alex Fabrikant Tad Hogg EECS Dept., UC Berkeley Add to Reading List Source URL: alex.fabrikant.us Language: English - Date: 2010-01-07 19:33:22 NP-complete problems Search algorithms Graph coloring Routing algorithms Quantum algorithm Heuristic function A* search algorithm Algorithm Travelling salesman problem Theoretical computer science Mathematics Applied mathematics
913	Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science, Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 02:04:54 NP-complete problems Combinatorics Mathematical optimization Partition problem Heuristics Graph theory Heuristic function Bin packing problem Travelling salesman problem Mathematics Theoretical computer science Computational complexity theory
914	Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345 Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 01:10:58 Automated theorem proving Boolean algebra NP-complete problems Constraint programming Logic in computer science Boolean satisfiability problem Davis–Putnam algorithm Satisfiability Unit propagation Theoretical computer science Mathematics Computational complexity theory
915	Lecture V §1. Joy Rides Page 1 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-10-01 09:47:54 NP-complete problems Operations research Bin packing problem Mathematical optimization Greedy algorithm Minimum spanning tree Packing problem Dynamic programming Approximation algorithm Mathematics Theoretical computer science Applied mathematics
916	Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems Add to Reading List Source URL: www.jair.org Language: English - Date: 2009-08-06 19:20:44 NP-complete problems Discrete geometry Operations research Combinatorial optimization Bin packing problem Generalized assignment problem Knapsack problem Packing problem Strongly NP-complete Theoretical computer science Computational complexity theory Mathematics
917	metaSMT: A Unified Interface to SMT-LIB2 Heinz Riener, Mathias Soeken, Clemens Werther, Görschwin Fey and Rolf Drechsler University of Bremen [removed] Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2014-10-20 06:13:55 C++ Constraint programming Electronic design automation Satisfiability Modulo Theories Z3 X26 Typedef X38 CTX Theoretical computer science Applied mathematics NP-complete problems
918	Fast Construction of the Vietoris-Rips Complex Afra Zomorodian∗ (To appear in Computer & Graphics) 100 Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2010-03-17 14:16:35 Graph operations Topology NP-complete problems Clique Vietoris–Rips complex Line graph Cograph Triangulation Graph Graph theory Mathematics Algebraic topology
919	Sudoku Creation and Grading Andrew C. Stuart February 2007 Updated Jan[removed]Introduction Add to Reading List Source URL: www.sudokuwiki.org Language: English - Date: 2014-03-24 18:51:08 Recreational mathematics Sudoku Puzzle video games NP-complete problems Str8ts Killer sudoku KenKen Mathematical puzzle Puzzle Logic puzzles Mathematics Games
920	On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas ˇ ˇ Ondˇrej Cepek and Stefan Add to Reading List Source URL: www.cs.uic.edu Language: English - Date: 2013-12-21 14:10:02 Logic in computer science Boolean algebra Complexity classes NP-complete problems Conjunctive normal form Computational problems 2-satisfiability Boolean satisfiability problem Disjunctive normal form Theoretical computer science Computational complexity theory Applied mathematics

UPDATE